منابع مشابه
Large data sets are powerful.
The problems with large data sets highlighted by Drake and McHugo—poor-quality data, statistical significance without meaningfulness, multiple tests, and post hoc interpretations—are neither new nor unique to large data sets. In addition, not all administrative data sets are necessarily large. It is difficult to find good data, administrative or otherwise, and to use it appropriately. Researche...
متن کاملThe Power of Powerful Numbers
In this note we discuss recent progress concerning powerful numbers, raise new questions and show that solutions to existing open questions concerning powerful numbers would yield advancement of solutions to deep, long-standing problems such as Fermat's Last Theorem. This is primarily a survey article containing no new, unpublished results. A powerful number is a positive integer n which is div...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملNumbers Are Just Numbers
Making good choices about retirement involves the processing of numbers. In particular, consumers must have easily available, accurate, and timely numbers, and they must also use them. Contrary to the consumer-driven approach, however, the evidence demonstrates that having an abundance of information does not always translate into it being used to inform choices. The challenge is not merely to ...
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1984
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1984-0740165-6